Reasoning about Triggered Scenarios in Logic Programming

This paper presents a logic programming approach, based on the Event Calculus (EC), for representing and reasoning about triggered scenarios (TS), an expressive dialect of message sequence charts widely employed in software requirements engineering to specify system behaviour. We introduce a sound translation for triggered scenarios into an EC-based Answer Set Programming (ASP) representation, and demonstrate how this formalisation allows for the use of ASP as an alternative verification method capable of overcoming known limitations of current TS analysis methods.